Stabilizers for GF(5)-representable matroids
نویسنده
چکیده
The matroid terminology follows Oxley [4]. Two r×n matrices A and A′ representing the same matroid M over a field GF(q) are called projectively equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Otherwise they are called projectively inequivalent. The matrices A and A′ are called equivalent representations of M if, in addition to elementary row operations and column scaling, A′ may be obtained from A by replacing each entry of A by its image under a non-trivial automorphism of GF(q). Otherwise they are called inequivalent representations. For prime fields, as in this case, projective equivalence and equivalence coincide as prime fields do not have non-trivial automorphisms.
منابع مشابه
On Matroids Representable over Gf (3) and Other Fields
The matroids that are representable over GF (3) and some other fields depend on the choice of field. This paper gives matrix characterisations of the classes that arise. These characterisations are analogues of the characterisation of regular matroids as the ones that can be represented over the rationals by a totally-unimodular matrix. Some consequences of the theory are as follows. A matroid ...
متن کاملOrienting Matroids Representable Over Both GF(3) and GF(5)
For matroids representable over both GF 3] and GF 5], we provide a recipe for constructing an orientation.
متن کاملThe Excluded Minors for Gf(4)--representable Matroids the Excluded Minors for Gf(4){representable Matroids
There are exactly seven excluded minors for the class of GF(4){representable matroids. Note: The research for this paper was carried out under the PNA1.1-project P&BS of CWI, while J.F. Geelen and A. Kapoor visited the CWI in Amsterdam with nancial support from EIDMA.
متن کاملBicircular matroids representable over GF(4) or GF(5)
Given a bicircular matroid B(G) and q ∈ {4, 5}, we characterize when the bicircular matroid B(G) is GF (q)-representable by precisely describing the structure of G. These descriptions yield polynomial-time algorithms with input G to certify if B(G) is or is not GF (q)-representable.
متن کاملGrowth rate functions of dense classes of representable matroids
For each proper minor-closed subclassM of the GF(q)representable matroids containing all GF(q)-representable matroids, we give, for all large r, a tight upper bound on the number of points in a rank-r matroid inM, and give a rank-r matroid inM for which equality holds. As a consequence, we give a tight upper bound on the number of points in a GF(q)-representable, rank-r matroid of large rank wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 49 شماره
صفحات -
تاریخ انتشار 2011